DIMPLE-II: Dynamic Membership Protocol for Epidemic Protocols

DIMPLE - II : Dynamic Membership Protocol for Epidemic Protocols 1

Connectivity Recovery in Epidemic Membership Protocols

Epidemic protocols are a bio-inspired communication and computation paradigm for extreme-scale network system based on randomized communication. The protocols rely on a membership service to build decentralized and random overlay topologies. In a weakly connected overlay topology, a naive mechanism of membership protocols can break the connectivity, thus impairing the accuracy of the applicatio...

An Approach for Accurate Edging using Dynamic Membership Functions

In this paper, by means of fuzzy approaches, an accurate method is introduced for edging of color photographs. The difference between our method with other similar methods is the use of a morphological operation to think or thick the obtained edges. In this proposed method, a 3×3 window is dragged on the photo. For each block, 12 point sets will be defined, each including two non-overlapping po...

Membership-Oblivious Protocols

Many distributed protocols explicitly depend on membership information, such as the identity or number of sites that are currently part of the system. Given this importance, several mechanisms have been proposed over the past decades to handle membership information, but most of them do not scale well in largeand highlydynamic systems. In this paper we advocate the use of “membership-oblivious”...

Group membership in the epidemic style

Existing group membership mechanisms provide consistent views of membership changes. However, they require heavyweight synchronous multicast protocols. We present a new lightweight group membership mechanism that allows temporary inconsistencies in membership views. This mechanism uses epidemic communication techniques to ensure that all group members eventually converge to a consistent view of...